Generalized Lyapunov Equations and Positive Definite Functions
نویسندگان
چکیده
We establish the positive definiteness of some functions and of some matrices that arise as solutions of generalized Lyapunov equations. Mathematics Subject Classification (2000) : 42A82, 47A62, 15A24, 15A48.
منابع مشابه
Positive definite solutions of some matrix equations
In this paper we investigate some existence questions of positive semi-definite solutions for certain classes of matrix equations known as the generalized Lyapunov equations. We present sufficient and necessary conditions for certain equations and only sufficient for others. © 2008 Elsevier Inc. All rights reserved. AMS classification: 15A24; 15A48; 42A82; 47A62
متن کاملGENERALIZED POSITIVE DEFINITE FUNCTIONS AND COMPLETELY MONOTONE FUNCTIONS ON FOUNDATION SEMIGROUPS
A general notion of completely monotone functionals on an ordered Banach algebra B into a proper H*-algebra A with an integral representation for such functionals is given. As an application of this result we have obtained a characterization for the generalized completely continuous monotone functions on weighted foundation semigroups. A generalized version of Bochner’s theorem on foundation se...
متن کاملProjected Generalized Discrete-Time Periodic Lyapunov Equations and Balanced Realization of Periodic Descriptor Systems
From the necessary and sufficient conditions for complete reachability and observability of periodic time-varying descriptor systems, the symmetric positive semi-definite reachability/observability Gramians are defined. These Gramians can be shown to satisfy some projected generalized discrete-time periodic Lyapunov equations. We propose a numerical method for solving these projected Lyapunov e...
متن کاملReachability/Observability Gramians and Balanced Realization of Periodic Descriptor Systems
In this paper necessary and sufficient conditions are derived for complete reachability and observability of periodic time-varying descriptor systems. Applying these conditions, the symmetric positive semi-definite reachability/observability Gramians are defined and can be shown to satisfy some projected generalized discrete-time periodic Lyapunov equations. We propose a numerical method for so...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 27 شماره
صفحات -
تاریخ انتشار 2005